'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  f(g(i(a(), b(), b'()), c()), d()) ->
       if(e(), f(.(b(), c()), d'()), f(.(b'(), c()), d'()))
     , f(g(h(a(), b()), c()), d()) ->
       if(e(), f(.(b(), g(h(a(), b()), c())), d()), f(c(), d'()))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  f^#(g(i(a(), b(), b'()), c()), d()) ->
      c_0(f^#(.(b(), c()), d'()), f^#(.(b'(), c()), d'()))
    , f^#(g(h(a(), b()), c()), d()) ->
      c_1(f^#(.(b(), g(h(a(), b()), c())), d()), f^#(c(), d'()))}
  
  The usable rules are:
   {}
  
  The dependency graph contains no edges.
  
  We are done: the estimated dependency graph contains no edges and moreover, the usable rules are empty.